Baire classes of complex L 1-preduals
نویسندگان
چکیده
منابع مشابه
Real Recursive Functions and Baire Classes
Recursive functions over the reals [6] have been considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes [2]. However, one of the operators introduced in the seminal paper by Cris Moore (in 1996), the minimalization operator, creates some difficulties: (a) although differential recursion (the analog counterp...
متن کاملOn Certain Classes of Baire-1 Functions with Applications to Banach Space Theory
Certain subclasses of B 1 (K), the Baire-1 functions on a compact metric space K, are defined and characterized. Some applications to Banach spaces are given. Let X be a separable infinite dimensional Banach space and let K denote its dual ball, Ba(X *), with the weak* topology. K is compact metric and X may be naturally identified with a closed subspace of C(K). X * * may also be identified wi...
متن کاملPreduals of semigroup algebras
For a locally compact group G, the measure convolution algebra M(G) carries a natural coproduct. In previous work, we showed that the canonical predual C0(G) of M(G) is the unique predual which makes both the product and the coproduct on M(G) weak∗-continuous. Given a discrete semigroup S, the convolution algebra l(S) also carries a coproduct. In this paper we examine preduals for l(S) making b...
متن کاملBaire Categories on Small Complexity Classes and Meager-Comeager Laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ on how the corresponding finite extension strategies are computed. We give an alternative characterization of small sets via resource-bounded Banach-Mazur games. As an application of the first notion, we show that for...
متن کاملArithmetizing Classes Around NC 1 and L
The parallel complexity class NC has many equivalent models such as polynomial size formulae and bounded width branching programs. Caussinus et al. [CMTV98] considered arithmetizations of two of these classes, #NC and #BWBP. We further this study to include arithmetization of other classes. In particular, we show that counting paths in branching programs over visibly pushdown automata is in FLo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2015
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-015-0201-6